Tohoku Univ. Technology : Efficient solution of constrained quadratic programming problem in quantum annealer : T22-365
Possible to solve constrained quadratic programming problems
Recently, almost all combinatorial optimization problems are represented by constrained quadratic programming problems. However, in solving them, we further apply the penalty method, etc., transform them into unconstrained quadratic programming problems, and perform quantum annealing operations on the converted mathematical expressions. However, the conversion generated redundant variables that required a huge amount of computing resources, so that practical operations are impossible. We propose a method for solving all combinatorial optimization problems by quantum annealing, and it became possible to solve practically all optimization problem.
- Company：Tohoku Techno Arch Co., Ltd.
- Price：Other
